package leetcode.helper.tree;

/**
 * @author Max
 * @date 2021年8月19日
 * @description 337.打家劫舍 III <br>
 *              617.合并二叉树 <br>
 *
 * @see leetcode.code617.MergeTwoBinaryTrees
 */
public class TreeNode {

	public int val;
	public TreeNode left;
	public TreeNode right;

	public TreeNode() {
	}

	public TreeNode(int val) {
		this.val = val;
	}

	public TreeNode(int val, TreeNode left, TreeNode right) {
		this.val = val;
		this.left = left;
		this.right = right;
	}

}
